A Construction of Hierarchical Rough Set Approximations in Information Systems Using Dependency of Attributes

نویسندگان

  • Tutut Herawan
  • Iwan Tri Riyadi Yanto
  • Mustafa Mat Deris
چکیده

This paper presents an alternative approach for constructing a hierarchical rough set approximation in an information system. It is based on the notion of dependency of attributes. The proposed approach is started with the notion of a nested sequence of indiscernibility relations that can be defined from the dependency of attributes. With this notion, a nested rough set approximation can be easily constructed. Then, the notion of a nested rough set approximation is used for constructing a hierarchical rough set approximation. Lastly, applications of a hierarchical rough set approximation for data classification and capturing maximal association in document collection through information systems are presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Application of Rough Set Theory in Data Mining for Decision Support Systems (DSSs)

Decision support systems (DSSs) are prevalent information systems for decision making in many competitive business environments. In a DSS, decision making process is intimately related to some factors which determine the quality of information systems and their related products. Traditional approaches to data analysis usually cannot be implemented in sophisticated Companies, where managers ne...

متن کامل

Roughness of Sets Involving Dependency of Attributes in Information Systems

Rough set theory, proposed by Pawlak in 1980’s as a result of a long term program on mathematical fundamental research can be seen as a new mathematical approach to vagueness (set) and uncertainty (element) from databases (information systems) [1]. One of the important issues in rough set-based database analysis is discovering dependencies between attributes. An attribute dependency states that...

متن کامل

ROUGH SET OVER DUAL-UNIVERSES IN FUZZY APPROXIMATION SPACE

To tackle the problem with inexact, uncertainty and vague knowl- edge, constructive method is utilized to formulate lower and upper approx- imation sets. Rough set model over dual-universes in fuzzy approximation space is constructed. In this paper, we introduce the concept of rough set over dual-universes in fuzzy approximation space by means of cut set. Then, we discuss properties of rough se...

متن کامل

Roughness in modules by using the notion of reference points

 module over a ring is a general mathematical concept for many examples of mathematicalobjects that can be added to each other and multiplied by scalar numbers.In this paper, we consider a module over a ring as a universe and by using the notion of reference points, we provide local approximations for  subsets of the universe.

متن کامل

Probabilistic Rough Classification in Information Systems with Fuzzy Decision Attributes

Based on Pawlak’s two way approximations on Rough Sets and using thresholds G.Ganesan et al in 2004 proposed a method of rough indexing an information system which has fuzzy decision attributes. The limitation of Pawlak’s approximation is that it does not quantify the level of importance of the basic granules. Recently, Y.Y.Yao discussed Probabilistic Rough Set Model, which specified how basic ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010